A directed search strategy for evolutionary dynamic multiobjective optimization

Many real-worldmultiobjective optimization problems are dynamic, requiring an optimization algorithm that is able to continuously track the moving Pareto front over time. In this paper, we propose a directed search strategy (DSS) consisting of two mechanisms for improving the performance of multiobjective evolutionary algorithms in changing environments. The first mechanism reinitializes the population based on the predicted moving direction as well as the directions that are orthogonal to the moving direction of the Pareto set, when a change is detected. The second mechanism aims to accelerate the convergence by generating solutions in predicted regions of the Pareto set according to the moving direction of the non-dominated solutions between two consecutive generations. The two mechanisms, when combined together, are able to achieve a good balance between exploration and exploitation for evolutionary algorithms to solve dynamic multiobjective optimization problems. We compare DSS with two existing prediction strategies on a variety of test instances having different changing dynamics. Empirical results show that DSS is powerful for evolutionary algorithms to deal with dynamic multiobjective optimization problems. Yan Wu School of Mathematics and Statistics, Xidian University, Xian 710071, China E-mail: [email protected] Yaochu Jin Department of Computing, University of Surrey, Guildford, GU2 7XH, U.K. and College of Information Sciences and Technology, Donghua University, Shanghai 201620, China E-mail: [email protected] Xiaoxiong Liu School of Automation, Northwestern Polytechnical University, Xian 710072, China